On Discrete - Time Single - Server Queues with Markov Modulated Batch Bernoulli Input and Finite Capacity
نویسندگان
چکیده
This paper investigates a discrete-time system with Markov modulated batch Bernoulli process (MMBP) inputs, general service times, and a finite capacity waiting room (queue). The FIFa and space priority service rules are considered. The main motivation for studying this type of queue is its potential applicability to time-slotted communication systems in broadband ISDN (B-ISDN). Applying the supplementary variable technique and the matrix analysis approach, we obtain the steady-state distributions of the number of customers in the system as well as loss probabilities under individual service rules.
منابع مشابه
DISCRETE-TIME GI/D-MSP/1/K QUEUE WITH N THRESHOLD POLICY
This paper presents a discrete-time single-server finite buffer N threshold policy queue with renewal input and discreteMarkovian service process. The server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is N. We obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary...
متن کاملDiscrete-time Priority Queues with Two-state Markov Modulated Arrivals
A class of discrete-time priority queueing systems with Markov modulated arrivals is considered. In these systems, N queues are served by a single server according to priorities that are preassigned to the queues. Packet arrivals are modeled as discrete-time batch processes with a distribution that depends on the state of an independent common two-state Markov chain. This allows to cover a wide...
متن کاملبهدست آوردن میانگین زمان تکمیلپروژه در شبکههای پرتپویا (سیستم چندپروژهای) با ظرفیت محدود
In this paper, dynamic PERT networks with finite capacity of concurrent projects are expressed in the framework of networks of queues. In this investigation, it is assumed that the system capacity is finite and new projects are generated according to a Poisson process. There is only one server in every service station and the discipline of queue is FCFS (Fist Come, First Served). Each activity ...
متن کاملUsing Factorization in Analyzing D-bmap/g/1 Queues
The discrete-time batch Markovian arrival process (D-BMAP) was first defined in [2]. The D-BMAP can represent a variety of arrival processes which include, as special cases, the Bernoulli arrival process, the Markov-modulated Bernoulli process (MMBP), the discrete-time Markovian arrival process (D-MAP), and their superpositions. It is the discrete-time version of the versatile Markovian point p...
متن کاملStochastic bounds for a single server queue with general retrial times
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
متن کامل